A new iterative algorithm for split feasibility and fixed point problems
نویسندگان
چکیده
منابع مشابه
A New Hybrid Iterative Algorithm for Fixed-Point Problems, Variational Inequality Problems, and Mixed Equilibrium Problems
We introduce a new hybrid iterative algorithm for finding a common element of the set of fixed points of an infinite family of nonexpansive mappings, the set of solutions of the variational inequality of a monotone mapping, and the set of solutions of a mixed equilibrium problem. This study, proves a strong convergence theorem by the proposed hybrid iterative algorithm which solves fixed-point ...
متن کاملThe Mann-Type Extragradient Iterative Algorithms with Regularization for Solving Variational Inequality Problems, Split Feasibility, and Fixed Point Problems
and Applied Analysis 3 open topic. For example, it is yet not clear whether the dual approach to (7) of [29] can be extended to the SFP. The original algorithm given in [15] involves the computation of the inverse A (assuming the existence of the inverse of A), and thus has not become popular. A seemingly more popular algorithm that solves the SFP is the CQ algorithm of Byrne [16, 21] which is ...
متن کاملIterative algorithm for a family of split equilibrium problems and fixed point problems in Hilbert spaces with applications
In this paper, we propose an iterative algorithm and, by using the proposed algorithm, prove some strong convergence theorems for finding a common element of the set of solutions of a finite family of split equilibrium problems and the set of common fixed points of a countable family of nonexpansive mappings in Hilbert spaces. An example is given to illustrate the main result of this paper. As ...
متن کاملA Class of nonlinear $(A,eta)$-monotone operator inclusion problems with iterative algorithm and fixed point theory
A new class of nonlinear set-valued variationalinclusions involving $(A,eta)$-monotone mappings in a Banachspace setting is introduced, and then based on the generalizedresolvent operator technique associated with$(A,eta)$-monotonicity, the existence and approximationsolvability of solutions using an iterative algorithm and fixedpint theory is investigated.
متن کاملSplit Algorithms for New Implicit Feasibility Null-Point Problems
Inspired by the very recent work by Noor and Noor [9] and given a closed convex set-valued mapping C, we propose a split algorithm for solving the problem of finding an element x∗ which is a zero of a given maximal monotone operator T such that its image, Ax∗, under a linear operator, A, is in a closed convex set C(x∗). Then, we present two strong convergence results and state some examples as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of nonlinear and variational analysis
سال: 2021
ISSN: ['2560-6778', '2560-6921']
DOI: https://doi.org/10.23952/jnva.5.2021.2.02